Abstraction Methods for Solving Graph-Based Security Games
نویسندگان
چکیده
ion Methods for Solving Graph-Based Security Games Anjon Basak University of Texas at El Paso 500 W University Ave El Paso, TX 79902 [email protected] Fei Fang University of Southern California 941 Bloom Walk, SAL 300 Los Angeles, CA 90089 [email protected] Thanh Hong Nguyen University of Southern California 941 Bloom Walk, SAL 300 Los Angeles, CA, 90089 [email protected] Christopher Kiekintveld University of Texas at El Paso 500 W University Ave El Paso, TX 79902 [email protected]
منابع مشابه
Selecting Robust Strategies Based on Abstracted Game Models
Game theory is a tool for modeling multi-agent decision problems and has been used successfully in problems such as poker, security, and trading agents. However, many real games are extremely large[4]. One approach for solving large games is to use abstraction techniques to shrink the game to a form that can be solved by removing detail and translating a solution back to the original. However, ...
متن کاملAbstraction Using Analysis of Subgames
ion Using Analysis of Subgames Anjon Basak and Christopher Kiekintveld 1 The University of Texas at El Paso [email protected], 2 The University of Texas at El Paso [email protected] Abstract. Normal form games are one of the most familiar representations for modeling interactions among multiple agent. However, modeling many realistic interactions between agents results in games that a...
متن کاملSafe and Nested Endgame Solving for Imperfect-Information Games
Unlike perfect-information games, imperfect-information games cannot be decomposed into subgames that are solved independently. Thus more computationally intensive equilibrium-finding techniques are used, and abstraction— in which a smaller version of the game is generated and solved—is essential. Endgame solving is the process of computing a (presumably) better strategy for just an endgame tha...
متن کاملGradient Methods for Stackelberg Security Games
Stackelberg games are two-stage games in which the first player (called the leader) commits to a strategy, after which the other player (the follower) selects a best-response. These types of games have seen numerous practical application in security settings, where the leader (in this case, a defender) must allocate resources to protect various targets. Real world applications include the sched...
متن کاملSum Coloring : New upper bounds for the chromatic strength
The Minimum Sum Coloring Problem (MSCP ) is derived from the Graph Coloring Problem (GCP ) by associating a weight to each color. The aim ofMSCP is to find a coloring solution of a graph such that the sum of color weights is minimum.MSCP has important applications in fields such as scheduling and VLSI design. We propose in this paper new upper bounds of the chromatic strength, i.e. the minimum ...
متن کامل